________________________________________________________________

Run Header: Complete YList Version try 5: /small pw steps

Run start:        31.01.2010 10:36:05
Input Data from:  dataset134.txt
Iteration limit:  500
NI iter. limit:   200

# of Customers  :300
# of Locations  :10
Ex.Facilities   :3
Total budget    :20000
Terror. attacks :2

Penalty Weight : 0,5
Update Policy  : 4-3 of last 10
pw inc. step   : 0,005

Coverage Ratio :0,161333333333333
Average f[i]   :3650
Average g[i,j] :2076,19047619048
Total demand   :16990
________________________________________________________________

## ITERATION 0 #######################


> Neighbours evaluated; 29
> Selected Move:	4860	1	-1	4	6500


> New Y[]: 
	
	 2  3  4  0  1  0  0  0  0  0    >new incumb.: 4860


> New S[]: 
	
	 0  0  1  0  1  0  0  0  0  0 
 > pw :0,5

## ITERATION 1 #######################


> Neighbours evaluated; 22
> Selected Move:	7200	1	-1	8	12000


> New Y[]: 
	
	 2  3  4  0  1  0  0  0  1  0    >new incumb.: 7200


> New S[]: 
	
	 0  0  1  0  0  0  0  0  1  0 
 > pw :0,5

## ITERATION 2 #######################


> Neighbours evaluated; 30
> Selected Move:	9460	1	-1	9	16000


> New Y[]: 
	
	 2  3  4  0  1  0  0  0  1  1    >new incumb.: 9460


> New S[]: 
	
	 0  0  1  0  1  0  0  0  0  0 
 > pw :0,5

## ITERATION 3 #######################


> Neighbours evaluated; 25
> Selected Move:	10260	1	-1	5	20000


> New Y[]: 
	
	 2  3  4  0  1  1  0  0  1  1    >new incumb.: 10260


> New S[]: 
	
	 0  0  1  0  0  0  0  0  1  0 
 > pw :0,5

## ITERATION 4 #######################


> Neighbours evaluated; 22
> Selected Move:	9880	3	5	3	20500


> New Y[]: 
	
	 2  3  4  1  1  0  0  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  1 
 > pw :0,5

## ITERATION 5 #######################


> Neighbours evaluated; 21
> Selected Move:	9570	3	2	6	22000


> New Y[]: 
	
	 2  3  0  1  1  0  4  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  1 
 > pw :0,5

## ITERATION 6 #######################


> Neighbours evaluated; 15
> Selected Move:	9560	3	4	5	19500


> New Y[]: 
	
	 2  3  0  1  0  1  4  0  1  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,495

## ITERATION 7 #######################


> Neighbours evaluated; 20
> Selected Move:	9910	3	6	4	20100


> New Y[]: 
	
	 2  3  0  1  4  1  0  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  1 
 > pw :0,49

## ITERATION 8 #######################


> Neighbours evaluated; 20
> Selected Move:	9460	2	5	-1	16100


> New Y[]: 
	
	 2  3  0  1  4  0  0  0  1  1 


> New S[]: 
	
	 0  0  0  1  1  0  0  0  0  0 
 > pw :0,485

## ITERATION 9 #######################


> Neighbours evaluated; 20
> Selected Move:	9460	4	4	3	17600


> New Y[]: 
	
	 2  3  0  4  1  0  0  0  1  1 


> New S[]: 
	
	 0  0  0  1  1  0  0  0  0  0 
 > pw :0,48

## ITERATION 10 #######################


> Neighbours evaluated; 18
> Selected Move:	9460	4	3	8	17400


> New Y[]: 
	
	 2  3  0  1  1  0  0  0  4  1 


> New S[]: 
	
	 0  0  0  1  1  0  0  0  0  0 
 > pw :0,475

## ITERATION 11 #######################


> Neighbours evaluated; 18
> Selected Move:	9460	4	8	9	18300


> New Y[]: 
	
	 2  3  0  1  1  0  0  0  1  4 


> New S[]: 
	
	 0  0  0  1  1  0  0  0  0  0 
 > pw :0,47

## ITERATION 12 #######################


> Neighbours evaluated; 22
> Selected Move:	9020	3	3	7	19300


> New Y[]: 
	
	 2  3  0  0  1  0  0  1  1  4 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  1 
 > pw :0,465

## ITERATION 13 #######################


> Neighbours evaluated; 13
> Selected Move:	9020	4	9	4	17100


> New Y[]: 
	
	 2  3  0  0  4  0  0  1  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  1 
 > pw :0,46

## ITERATION 14 #######################


> Neighbours evaluated; 14
> Selected Move:	9324	1	-1	3	21600


> New Y[]: 
	
	 2  3  0  1  4  0  0  1  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  1 
 > pw :0,455

## ITERATION 15 #######################


> Neighbours evaluated; 18
> Selected Move:	9387	3	7	6	22600


> New Y[]: 
	
	 2  3  0  1  4  0  1  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  1 
 > pw :0,45

## ITERATION 16 #######################


> Neighbours evaluated; 16
> Selected Move:	9145	3	4	2	20500


> New Y[]: 
	
	 2  3  4  1  0  0  1  0  1  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,445

## ITERATION 17 #######################


> Neighbours evaluated; 19
> Selected Move:	9870	3	3	5	20000


> New Y[]: 
	
	 2  3  4  0  0  1  1  0  1  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,44

## ITERATION 18 #######################


> Neighbours evaluated; 27
> Selected Move:	9670	3	5	4	22500


> New Y[]: 
	
	 2  3  4  0  1  0  1  0  1  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  1  0 
 > pw :0,435

## ITERATION 19 #######################


> Neighbours evaluated; 19
> Selected Move:	9578	3	6	7	21500


> New Y[]: 
	
	 2  3  4  0  1  0  0  1  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  1 
 > pw :0,44

## ITERATION 20 #######################


> Neighbours evaluated; 21
> Selected Move:	9020	4	2	7	18400


> New Y[]: 
	
	 2  3  0  0  1  0  0  4  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  1 
 > pw :0,445

## ITERATION 21 #######################


> Neighbours evaluated; 13
> Selected Move:	9020	4	7	8	18400


> New Y[]: 
	
	 2  3  0  0  1  0  0  1  4  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  1 
 > pw :0,45

## ITERATION 22 #######################


> Neighbours evaluated; 21
> Selected Move:	8755	1	-1	3	22900


> New Y[]: 
	
	 2  3  0  1  1  0  0  1  4  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  1 
 > pw :0,455

## ITERATION 23 #######################


> Neighbours evaluated; 17
> Selected Move:	9323	3	7	5	21400


> New Y[]: 
	
	 2  3  0  1  1  1  0  0  4  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  1 
 > pw :0,46

## ITERATION 24 #######################


> Neighbours evaluated; 16
> Selected Move:	9224	4	8	3	21600


> New Y[]: 
	
	 2  3  0  4  1  1  0  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  1 
 > pw :0,465

## ITERATION 25 #######################


> Neighbours evaluated; 17
> Selected Move:	8890	4	3	9	22300


> New Y[]: 
	
	 2  3  0  1  1  1  0  0  1  4 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  1 
 > pw :0,47

## ITERATION 26 #######################


> Neighbours evaluated; 17
> Selected Move:	8925	3	9	2	20500


> New Y[]: 
	
	 2  3  4  1  1  1  0  0  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  1  0 
 > pw :0,475

## ITERATION 27 #######################


> Neighbours evaluated; 31
> Selected Move:	8882	3	4	6	20500


> New Y[]: 
	
	 2  3  4  1  0  1  1  0  1  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,48

## ITERATION 28 #######################


> Neighbours evaluated; 32
> Selected Move:	8880	3	6	9	18000


> New Y[]: 
	
	 2  3  4  1  0  1  0  0  1  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,485

## ITERATION 29 #######################


> Neighbours evaluated; 27
> Selected Move:	8860	3	3	7	19000


> New Y[]: 
	
	 2  3  4  0  0  1  0  1  1  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,49

## ITERATION 30 #######################


> Neighbours evaluated; 32
> Selected Move:	9051	3	2	4	21100


> New Y[]: 
	
	 2  3  0  0  4  1  0  1  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  1 
 > pw :0,495

## ITERATION 31 #######################


> Neighbours evaluated; 16
> Selected Move:	8862	3	4	6	20500


> New Y[]: 
	
	 2  3  0  0  0  1  4  1  1  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 32 #######################


> Neighbours evaluated; 19
> Selected Move:	8800	3	5	3	21000


> New Y[]: 
	
	 2  3  0  1  0  0  4  1  1  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,505

## ITERATION 33 #######################


> Neighbours evaluated; 27
> Selected Move:	8730	2	7	-1	15500


> New Y[]: 
	
	 2  3  0  1  0  0  4  0  1  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,51

## ITERATION 34 #######################


> Neighbours evaluated; 23
> Selected Move:	8730	4	6	3	17600


> New Y[]: 
	
	 2  3  0  4  0  0  1  0  1  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,515

## ITERATION 35 #######################


> Neighbours evaluated; 24
> Selected Move:	8960	3	3	2	16000


> New Y[]: 
	
	 2  3  4  0  0  0  1  0  1  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  1  0 
 > pw :0,52

## ITERATION 36 #######################


> Neighbours evaluated; 25
> Selected Move:	8850	3	0	4	18300


> New Y[]: 
	
	 0  3  4  0  2  0  1  0  1  1 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  0 
 > pw :0,515

## ITERATION 37 #######################


> Neighbours evaluated; 19
> Selected Move:	8850	4	4	6	18000


> New Y[]: 
	
	 0  3  4  0  1  0  2  0  1  1 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  0 
 > pw :0,51

## ITERATION 38 #######################


> Neighbours evaluated; 19
> Selected Move:	8850	4	6	8	19400


> New Y[]: 
	
	 0  3  4  0  1  0  1  0  2  1 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  0 
 > pw :0,505

## ITERATION 39 #######################


> Neighbours evaluated; 24
> Selected Move:	8648	4	8	9	20400


> New Y[]: 
	
	 0  3  4  0  1  0  1  0  1  2 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 40 #######################


> Neighbours evaluated; 24
> Selected Move:	8340	3	6	5	17900


> New Y[]: 
	
	 0  3  4  0  1  1  0  0  1  2 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  0 
 > pw :0,495

## ITERATION 41 #######################


> Neighbours evaluated; 24
> Selected Move:	8340	4	9	4	15800


> New Y[]: 
	
	 0  3  4  0  2  1  0  0  1  1 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  0 
 > pw :0,49

## ITERATION 42 #######################


> Neighbours evaluated; 25
> Selected Move:	8650	3	4	0	13500


> New Y[]: 
	
	 2  3  4  0  0  1  0  0  1  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,485

## ITERATION 43 #######################


> Neighbours evaluated; 31
> Selected Move:	8340	3	1	4	15200


> New Y[]: 
	
	 2  0  4  0  3  1  0  0  1  1 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0 
 > pw :0,48

## ITERATION 44 #######################


> Neighbours evaluated; 31
> Selected Move:	8850	3	5	6	17700


> New Y[]: 
	
	 2  0  4  0  3  0  1  0  1  1 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0 
 > pw :0,475

## ITERATION 45 #######################


> Neighbours evaluated; 29
> Selected Move:	8850	4	4	6	18200


> New Y[]: 
	
	 2  0  4  0  1  0  3  0  1  1 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0 
 > pw :0,47

## ITERATION 46 #######################


> Neighbours evaluated; 28
> Selected Move:	8850	4	6	8	19200


> New Y[]: 
	
	 2  0  4  0  1  0  1  0  3  1 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0 
 > pw :0,465

## ITERATION 47 #######################


> Neighbours evaluated; 29
> Selected Move:	8432	4	8	9	20900


> New Y[]: 
	
	 2  0  4  0  1  0  1  0  1  3 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0 
 > pw :0,46

## ITERATION 48 #######################


> Neighbours evaluated; 27
> Selected Move:	8340	3	6	5	18400


> New Y[]: 
	
	 2  0  4  0  1  1  0  0  1  3 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0 
 > pw :0,455

## ITERATION 49 #######################


> Neighbours evaluated; 29
> Selected Move:	8340	4	9	5	17800


> New Y[]: 
	
	 2  0  4  0  1  3  0  0  1  1 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0 
 > pw :0,45

## ITERATION 50 #######################


> Neighbours evaluated; 27
> Selected Move:	8340	4	5	8	16700


> New Y[]: 
	
	 2  0  4  0  1  1  0  0  3  1 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0 
 > pw :0,445

## ITERATION 51 #######################


> Neighbours evaluated; 30
> Selected Move:	7966	1	-1	3	21200


> New Y[]: 
	
	 2  0  4  1  1  1  0  0  3  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  1  0 
 > pw :0,44

## ITERATION 52 #######################


> Neighbours evaluated; 26
> Selected Move:	8500	4	8	4	19700


> New Y[]: 
	
	 2  0  4  1  3  1  0  0  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  1  0 
 > pw :0,435

## ITERATION 53 #######################


> Neighbours evaluated; 24
> Selected Move:	8501	3	3	6	21700


> New Y[]: 
	
	 2  0  4  0  3  1  1  0  1  1 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0 
 > pw :0,43

## ITERATION 54 #######################


> Neighbours evaluated; 27
> Selected Move:	8409	3	6	7	20700


> New Y[]: 
	
	 2  0  4  0  3  1  0  1  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  1  0 
 > pw :0,425

## ITERATION 55 #######################


> Neighbours evaluated; 25
> Selected Move:	8075	3	2	6	22200


> New Y[]: 
	
	 2  0  0  0  3  1  4  1  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  1  0 
 > pw :0,43

## ITERATION 56 #######################


> Neighbours evaluated; 22
> Selected Move:	8344	3	7	3	21200


> New Y[]: 
	
	 2  0  0  1  3  1  4  0  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  1  0 
 > pw :0,435

## ITERATION 57 #######################


> Neighbours evaluated; 22
> Selected Move:	8570	2	5	-1	17200


> New Y[]: 
	
	 2  0  0  1  3  0  4  0  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  1  0 
 > pw :0,44

## ITERATION 58 #######################


> Neighbours evaluated; 25
> Selected Move:	8570	4	4	3	19600


> New Y[]: 
	
	 2  0  0  3  1  0  4  0  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  1  0 
 > pw :0,445

## ITERATION 59 #######################


> Neighbours evaluated; 25
> Selected Move:	8570	4	3	6	19800


> New Y[]: 
	
	 2  0  0  4  1  0  3  0  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  1  0 
 > pw :0,45

## ITERATION 60 #######################


> Neighbours evaluated; 22
> Selected Move:	8570	4	3	4	18300


> New Y[]: 
	
	 2  0  0  1  4  0  3  0  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  1  0 
 > pw :0,455

## ITERATION 61 #######################


> Neighbours evaluated; 23
> Selected Move:	8570	4	4	8	19600


> New Y[]: 
	
	 2  0  0  1  1  0  3  0  4  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  1  0 
 > pw :0,45

## ITERATION 62 #######################


> Neighbours evaluated; 22
> Selected Move:	8570	4	6	4	19100


> New Y[]: 
	
	 2  0  0  1  3  0  1  0  4  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  1  0 
 > pw :0,445

## ITERATION 63 #######################


> Neighbours evaluated; 25
> Selected Move:	8730	3	4	1	17400


> New Y[]: 
	
	 2  3  0  1  0  0  1  0  4  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,44

## ITERATION 64 #######################


> Neighbours evaluated; 22
> Selected Move:	8944	1	-1	5	21400


> New Y[]: 
	
	 2  3  0  1  0  1  1  0  4  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,435

## ITERATION 65 #######################


> Neighbours evaluated; 22
> Selected Move:	8874	3	5	4	23900


> New Y[]: 
	
	 2  3  0  1  1  0  1  0  4  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  1 
 > pw :0,43

## ITERATION 66 #######################


> Neighbours evaluated; 11
> Selected Move:	8807	4	8	3	24100


> New Y[]: 
	
	 2  3  0  4  1  0  1  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  1 
 > pw :0,425

## ITERATION 67 #######################


> Neighbours evaluated; 10
> Selected Move:	8880	3	4	5	21600


> New Y[]: 
	
	 2  3  0  4  0  1  1  0  1  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,42

## ITERATION 68 #######################


> Neighbours evaluated; 20
> Selected Move:	8658	3	6	7	20600


> New Y[]: 
	
	 2  3  0  4  0  1  0  1  1  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,425

## ITERATION 69 #######################


> Neighbours evaluated; 22
> Selected Move:	8743	3	5	4	23100


> New Y[]: 
	
	 2  3  0  4  1  0  0  1  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  1 
 > pw :0,43

## ITERATION 70 #######################


> Neighbours evaluated; 13
> Selected Move:	8813	4	3	7	22900


> New Y[]: 
	
	 2  3  0  1  1  0  0  4  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  1 
 > pw :0,435

## ITERATION 71 #######################


> Neighbours evaluated; 19
> Selected Move:	8742	3	7	5	22800


> New Y[]: 
	
	 2  3  0  1  1  4  0  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  1 
 > pw :0,44

## ITERATION 72 #######################


> Neighbours evaluated; 17
> Selected Move:	8340	2	4	-1	16300


> New Y[]: 
	
	 2  3  0  1  0  4  0  0  1  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,445

## ITERATION 73 #######################


> Neighbours evaluated; 26
> Selected Move:	8340	4	5	3	15100


> New Y[]: 
	
	 2  3  0  4  0  1  0  0  1  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,45

## ITERATION 74 #######################


> Neighbours evaluated; 22
> Selected Move:	8340	4	3	8	14900


> New Y[]: 
	
	 2  3  0  1  0  1  0  0  4  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,455

## ITERATION 75 #######################


> Neighbours evaluated; 23
> Selected Move:	8728	1	-1	7	20400


> New Y[]: 
	
	 2  3  0  1  0  1  0  1  4  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,46

## ITERATION 76 #######################


> Neighbours evaluated; 19
> Selected Move:	8726	4	8	7	20400


> New Y[]: 
	
	 2  3  0  1  0  1  0  4  1  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,465

## ITERATION 77 #######################


> Neighbours evaluated; 23
> Selected Move:	8474	3	3	4	22400


> New Y[]: 
	
	 2  3  0  0  1  1  0  4  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  1 
 > pw :0,47

## ITERATION 78 #######################


> Neighbours evaluated; 12
> Selected Move:	8462	4	7	8	22400


> New Y[]: 
	
	 2  3  0  0  1  1  0  1  4  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  1 
 > pw :0,475

## ITERATION 79 #######################


> Neighbours evaluated; 15
> Selected Move:	8710	3	8	2	20000


> New Y[]: 
	
	 2  3  4  0  1  1  0  1  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,48

## ITERATION 80 #######################


> Neighbours evaluated; 31
> Selected Move:	8540	3	9	8	21500


> New Y[]: 
	
	 2  3  4  0  1  1  0  1  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  1  0 
 > pw :0,485

## ITERATION 81 #######################


> Neighbours evaluated; 27
> Selected Move:	8560	2	5	-1	17500


> New Y[]: 
	
	 2  3  4  0  1  0  0  1  1  0 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  1  0 
 > pw :0,49

## ITERATION 82 #######################


> Neighbours evaluated; 30
> Selected Move:	8690	3	7	3	16500


> New Y[]: 
	
	 2  3  4  1  1  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  1  0 
 > pw :0,495

## ITERATION 83 #######################


> Neighbours evaluated; 33
> Selected Move:	8620	3	2	7	18900


> New Y[]: 
	
	 2  3  0  1  1  0  0  4  1  0 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  1  0 
 > pw :0,5

## ITERATION 84 #######################


> Neighbours evaluated; 21
> Selected Move:	8620	4	7	3	19100


> New Y[]: 
	
	 2  3  0  4  1  0  0  1  1  0 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  1  0 
 > pw :0,505

## ITERATION 85 #######################


> Neighbours evaluated; 20
> Selected Move:	8620	4	3	4	17600


> New Y[]: 
	
	 2  3  0  1  4  0  0  1  1  0 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  1  0 
 > pw :0,5

## ITERATION 86 #######################


> Neighbours evaluated; 22
> Selected Move:	8620	4	4	8	18900


> New Y[]: 
	
	 2  3  0  1  1  0  0  1  4  0 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  1  0 
 > pw :0,495

## ITERATION 87 #######################


> Neighbours evaluated; 25
> Selected Move:	8280	3	7	6	19900


> New Y[]: 
	
	 2  3  0  1  1  0  1  0  4  0 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  1  0 
 > pw :0,49

## ITERATION 88 #######################


> Neighbours evaluated; 21
> Selected Move:	8280	4	8	4	18600


> New Y[]: 
	
	 2  3  0  1  4  0  1  0  1  0 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  1  0 
 > pw :0,485

## ITERATION 89 #######################


> Neighbours evaluated; 23
> Selected Move:	8730	3	4	9	18300


> New Y[]: 
	
	 2  3  0  1  0  0  1  0  1  4 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,48

## ITERATION 90 #######################


> Neighbours evaluated; 22
> Selected Move:	8570	3	1	4	20000


> New Y[]: 
	
	 2  0  0  1  3  0  1  0  1  4 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  1  0 
 > pw :0,475

## ITERATION 91 #######################


> Neighbours evaluated; 23
> Selected Move:	8570	4	9	3	19300


> New Y[]: 
	
	 2  0  0  4  3  0  1  0  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  1  0 
 > pw :0,47

## ITERATION 92 #######################


> Neighbours evaluated; 22
> Selected Move:	8476	4	3	4	20200


> New Y[]: 
	
	 2  0  0  3  4  0  1  0  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  1  0 
 > pw :0,465

## ITERATION 93 #######################


> Neighbours evaluated; 22
> Selected Move:	8570	4	3	8	19300


> New Y[]: 
	
	 2  0  0  1  4  0  1  0  3  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  1  0 
 > pw :0,46

## ITERATION 94 #######################


> Neighbours evaluated; 23
> Selected Move:	8570	4	4	6	18700


> New Y[]: 
	
	 2  0  0  1  1  0  4  0  3  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  1  0 
 > pw :0,455

## ITERATION 95 #######################


> Neighbours evaluated; 22
> Selected Move:	8388	4	8	9	20400


> New Y[]: 
	
	 2  0  0  1  1  0  4  0  1  3 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  1  0 
 > pw :0,45

## ITERATION 96 #######################


> Neighbours evaluated; 24
> Selected Move:	8345	4	6	9	20500


> New Y[]: 
	
	 2  0  0  1  1  0  3  0  1  4 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  1  0 
 > pw :0,445

## ITERATION 97 #######################


> Neighbours evaluated; 22
> Selected Move:	7916	3	6	5	20100


> New Y[]: 
	
	 2  0  0  1  1  3  0  0  1  4 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  1  0 
 > pw :0,44

## ITERATION 98 #######################


> Neighbours evaluated; 21
> Selected Move:	7960	4	5	3	19900


> New Y[]: 
	
	 2  0  0  3  1  1  0  0  1  4 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  1  0 
 > pw :0,435

## ITERATION 99 #######################


> Neighbours evaluated; 23
> Selected Move:	7960	4	3	4	17500


> New Y[]: 
	
	 2  0  0  1  3  1  0  0  1  4 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  1  0 
 > pw :0,43

## ITERATION 100 #######################


> Neighbours evaluated; 23
> Selected Move:	8340	3	4	1	15800


> New Y[]: 
	
	 2  3  0  1  0  1  0  0  1  4 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,425

## ITERATION 101 #######################


> Neighbours evaluated; 23
> Selected Move:	8583	1	-1	6	22300


> New Y[]: 
	
	 2  3  0  1  0  1  1  0  1  4 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,43

## ITERATION 102 #######################


> Neighbours evaluated; 18
> Selected Move:	8506	3	5	4	24800


> New Y[]: 
	
	 2  3  0  1  1  0  1  0  1  4 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  1 
 > pw :0,435

## ITERATION 103 #######################


> Neighbours evaluated; 12
> Selected Move:	8565	3	9	2	23000


> New Y[]: 
	
	 2  3  4  1  1  0  1  0  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  1  0 
 > pw :0,44

## ITERATION 104 #######################


> Neighbours evaluated; 23
> Selected Move:	8550	3	8	9	21500


> New Y[]: 
	
	 2  3  4  1  1  0  1  0  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,445

## ITERATION 105 #######################


> Neighbours evaluated; 29
> Selected Move:	8500	3	6	5	19000


> New Y[]: 
	
	 2  3  4  1  1  1  0  0  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,45

## ITERATION 106 #######################


> Neighbours evaluated; 32
> Selected Move:	8475	1	-1	8	24500


> New Y[]: 
	
	 2  3  4  1  1  1  0  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  1 
 > pw :0,455

## ITERATION 107 #######################


> Neighbours evaluated; 9
> Selected Move:	8364	4	0	4	20300


> New Y[]: 
	
	 0  3  4  1  2  1  0  0  1  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  1  0 
 > pw :0,46

## ITERATION 108 #######################


> Neighbours evaluated; 22
> Selected Move:	8182	3	3	6	22300


> New Y[]: 
	
	 0  3  4  0  2  1  1  0  1  1 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  0 
 > pw :0,465

## ITERATION 109 #######################


> Neighbours evaluated; 18
> Selected Move:	8310	4	4	6	22000


> New Y[]: 
	
	 0  3  4  0  1  1  2  0  1  1 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  0 
 > pw :0,47

## ITERATION 110 #######################


> Neighbours evaluated; 22
> Selected Move:	8080	3	4	3	20000


> New Y[]: 
	
	 0  3  4  1  0  1  2  0  1  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  1  0 
 > pw :0,475

## ITERATION 111 #######################


> Neighbours evaluated; 23
> Selected Move:	8022	3	5	4	22500


> New Y[]: 
	
	 0  3  4  1  1  0  2  0  1  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  1  0 
 > pw :0,48

## ITERATION 112 #######################


> Neighbours evaluated; 12
> Selected Move:	8570	4	2	3	19600


> New Y[]: 
	
	 0  3  0  4  1  0  2  0  1  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  1  0 
 > pw :0,485

## ITERATION 113 #######################


> Neighbours evaluated; 19
> Selected Move:	8570	4	3	4	18100


> New Y[]: 
	
	 0  3  0  1  4  0  2  0  1  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  1  0 
 > pw :0,49

## ITERATION 114 #######################


> Neighbours evaluated; 21
> Selected Move:	8570	4	4	6	17800


> New Y[]: 
	
	 0  3  0  1  2  0  4  0  1  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  1  0 
 > pw :0,495

## ITERATION 115 #######################


> Neighbours evaluated; 21
> Selected Move:	8570	4	4	3	19900


> New Y[]: 
	
	 0  3  0  2  1  0  4  0  1  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  1  0 
 > pw :0,5

## ITERATION 116 #######################


> Neighbours evaluated; 14
> Selected Move:	8570	4	3	8	18900


> New Y[]: 
	
	 0  3  0  1  1  0  4  0  2  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  1  0 
 > pw :0,495

## ITERATION 117 #######################


> Neighbours evaluated; 20
> Selected Move:	8570	4	6	4	19500


> New Y[]: 
	
	 0  3  0  1  4  0  1  0  2  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  1  0 
 > pw :0,49

## ITERATION 118 #######################


> Neighbours evaluated; 19
> Selected Move:	8570	4	4	8	19700


> New Y[]: 
	
	 0  3  0  1  2  0  1  0  4  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  1  0 
 > pw :0,485

## ITERATION 119 #######################


> Neighbours evaluated; 17
> Selected Move:	8570	4	4	6	19400


> New Y[]: 
	
	 0  3  0  1  1  0  2  0  4  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  1  0 
 > pw :0,48

## ITERATION 120 #######################


> Neighbours evaluated; 17
> Selected Move:	8426	4	8	9	20300


> New Y[]: 
	
	 0  3  0  1  1  0  2  0  1  4 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  1  0 
 > pw :0,475

## ITERATION 121 #######################


> Neighbours evaluated; 16
> Selected Move:	8570	4	6	9	19900


> New Y[]: 
	
	 0  3  0  1  1  0  4  0  1  2 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  1  0 
 > pw :0,47

## ITERATION 122 #######################


> Neighbours evaluated; 17
> Selected Move:	8335	4	6	4	20500


> New Y[]: 
	
	 0  3  0  1  4  0  1  0  1  2 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  1  0 
 > pw :0,465

## ITERATION 123 #######################


> Neighbours evaluated; 18
> Selected Move:	8338	4	9	3	20500


> New Y[]: 
	
	 0  3  0  2  4  0  1  0  1  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  1  0 
 > pw :0,46

## ITERATION 124 #######################


> Neighbours evaluated; 13
> Selected Move:	8570	4	3	4	19900


> New Y[]: 
	
	 0  3  0  4  2  0  1  0  1  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  1  0 
 > pw :0,455

## ITERATION 125 #######################


> Neighbours evaluated; 16
> Selected Move:	8297	4	3	9	20600


> New Y[]: 
	
	 0  3  0  1  2  0  1  0  1  4 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  1  0 
 > pw :0,45

## ITERATION 126 #######################


> Neighbours evaluated; 18
> Selected Move:	7960	3	6	5	18100


> New Y[]: 
	
	 0  3  0  1  2  1  0  0  1  4 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  1  0 
 > pw :0,445

## ITERATION 127 #######################


> Neighbours evaluated; 21
> Selected Move:	7960	4	4	8	19200


> New Y[]: 
	
	 0  3  0  1  1  1  0  0  2  4 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  1  0 
 > pw :0,44

## ITERATION 128 #######################


> Neighbours evaluated; 21
> Selected Move:	7960	4	8	9	19300


> New Y[]: 
	
	 0  3  0  1  1  1  0  0  4  2 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  1  0 
 > pw :0,435

## ITERATION 129 #######################


> Neighbours evaluated; 20
> Selected Move:	7960	4	8	3	19500


> New Y[]: 
	
	 0  3  0  4  1  1  0  0  1  2 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  1  0 
 > pw :0,43

## ITERATION 130 #######################


> Neighbours evaluated; 21
> Selected Move:	7960	4	3	4	18000


> New Y[]: 
	
	 0  3  0  1  4  1  0  0  1  2 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  1  0 
 > pw :0,425

## ITERATION 131 #######################


> Neighbours evaluated; 18
> Selected Move:	7960	4	9	3	18000


> New Y[]: 
	
	 0  3  0  2  4  1  0  0  1  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  1  0 
 > pw :0,42

## ITERATION 132 #######################


> Neighbours evaluated; 21
> Selected Move:	7960	4	3	4	17400


> New Y[]: 
	
	 0  3  0  4  2  1  0  0  1  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  1  0 
 > pw :0,415

## ITERATION 133 #######################


> Neighbours evaluated; 18
> Selected Move:	7960	4	3	5	18600


> New Y[]: 
	
	 0  3  0  1  2  4  0  0  1  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  1  0 
 > pw :0,41

## ITERATION 134 #######################


> Neighbours evaluated; 19
> Selected Move:	7960	4	4	5	17900


> New Y[]: 
	
	 0  3  0  1  4  2  0  0  1  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  1  0 
 > pw :0,405

## ITERATION 135 #######################


> Neighbours evaluated; 17
> Selected Move:	7960	4	4	3	19400


> New Y[]: 
	
	 0  3  0  4  1  2  0  0  1  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  1  0 
 > pw :0,4

## ITERATION 136 #######################


> Neighbours evaluated; 13
> Selected Move:	8340	3	3	2	17800


> New Y[]: 
	
	 0  3  4  0  1  2  0  0  1  1 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  0 
 > pw :0,395

## ITERATION 137 #######################


> Neighbours evaluated; 20
> Selected Move:	8340	4	5	8	16900


> New Y[]: 
	
	 0  3  4  0  1  1  0  0  2  1 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  0 
 > pw :0,39

## ITERATION 138 #######################


> Neighbours evaluated; 29
> Selected Move:	7960	3	2	3	18500


> New Y[]: 
	
	 0  3  0  4  1  1  0  0  2  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  1  0 
 > pw :0,385

## ITERATION 139 #######################


> Neighbours evaluated; 16
> Selected Move:	8185	3	5	6	21000


> New Y[]: 
	
	 0  3  0  4  1  0  1  0  2  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  1  0 
 > pw :0,38

## ITERATION 140 #######################


> Neighbours evaluated; 15
> Selected Move:	8280	3	8	0	18600


> New Y[]: 
	
	 2  3  0  4  1  0  1  0  0  1 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  1 
 > pw :0,375

## ITERATION 141 #######################


> Neighbours evaluated; 25
> Selected Move:	8280	4	3	4	17100


> New Y[]: 
	
	 2  3  0  1  4  0  1  0  0  1 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  1 
 > pw :0,37

## ITERATION 142 #######################


> Neighbours evaluated; 22
> Selected Move:	8280	4	4	6	16500


> New Y[]: 
	
	 2  3  0  1  1  0  4  0  0  1 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  1 
 > pw :0,365

## ITERATION 143 #######################


> Neighbours evaluated; 22
> Selected Move:	8488	1	-1	5	20500


> New Y[]: 
	
	 2  3  0  1  1  1  4  0  0  1 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  1 
 > pw :0,36

## ITERATION 144 #######################


> Neighbours evaluated; 26
> Selected Move:	8700	1	-1	8	26000


> New Y[]: 
	
	 2  3  0  1  1  1  4  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  1 
 > pw :0,355

## ITERATION 145 #######################


> Neighbours evaluated; 12
> Selected Move:	8517	4	6	4	26600


> New Y[]: 
	
	 2  3  0  1  4  1  1  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  1 
 > pw :0,35

## ITERATION 146 #######################


> Neighbours evaluated; 15
> Selected Move:	8570	3	6	7	25600


> New Y[]: 
	
	 2  3  0  1  4  1  0  1  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  1 
 > pw :0,355

## ITERATION 147 #######################


> Neighbours evaluated; 19
> Selected Move:	8622	2	9	-1	21600


> New Y[]: 
	
	 2  3  0  1  4  1  0  1  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  1  0 
 > pw :0,36

## ITERATION 148 #######################


> Neighbours evaluated; 25
> Selected Move:	8790	3	4	6	21000


> New Y[]: 
	
	 2  3  0  1  0  1  4  1  1  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,365

## ITERATION 149 #######################


> Neighbours evaluated; 27
> Selected Move:	8523	3	5	4	23500


> New Y[]: 
	
	 2  3  0  1  1  0  4  1  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  1  0 
 > pw :0,37

## ITERATION 150 #######################


> Neighbours evaluated; 23
> Selected Move:	8990	3	3	9	23000


> New Y[]: 
	
	 2  3  0  0  1  0  4  1  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  1 
 > pw :0,375

## ITERATION 151 #######################


> Neighbours evaluated; 12
> Selected Move:	8750	4	6	4	23600


> New Y[]: 
	
	 2  3  0  0  4  0  1  1  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  1 
 > pw :0,38

## ITERATION 152 #######################


> Neighbours evaluated; 15
> Selected Move:	8780	3	4	2	21500


> New Y[]: 
	
	 2  3  4  0  0  0  1  1  1  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,385

## ITERATION 153 #######################


> Neighbours evaluated; 29
> Selected Move:	8458	3	8	4	22500


> New Y[]: 
	
	 2  3  4  0  1  0  1  1  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,39

## ITERATION 154 #######################


> Neighbours evaluated; 30
> Selected Move:	8410	3	9	8	24000


> New Y[]: 
	
	 2  3  4  0  1  0  1  1  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  1  0 
 > pw :0,395

## ITERATION 155 #######################


> Neighbours evaluated; 24
> Selected Move:	8398	3	4	5	21500


> New Y[]: 
	
	 2  3  4  0  0  1  1  1  1  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,4

## ITERATION 156 #######################


> Neighbours evaluated; 30
> Selected Move:	8200	2	5	-1	17500


> New Y[]: 
	
	 2  3  4  0  0  0  1  1  1  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  1  0 
 > pw :0,405

## ITERATION 157 #######################


> Neighbours evaluated; 29
> Selected Move:	8390	3	7	3	16500


> New Y[]: 
	
	 2  3  4  1  0  0  1  0  1  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,41

## ITERATION 158 #######################


> Neighbours evaluated; 33
> Selected Move:	8280	3	3	4	18500


> New Y[]: 
	
	 2  3  4  0  1  0  1  0  1  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  1  0 
 > pw :0,415

## ITERATION 159 #######################


> Neighbours evaluated; 26
> Selected Move:	8280	3	8	9	17000


> New Y[]: 
	
	 2  3  4  0  1  0  1  0  0  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  1 
 > pw :0,42

## ITERATION 160 #######################


> Neighbours evaluated; 32
> Selected Move:	8340	3	6	7	16000


> New Y[]: 
	
	 2  3  4  0  1  0  0  1  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,425

## ITERATION 161 #######################


> Neighbours evaluated; 33
> Selected Move:	8200	3	2	6	17500


> New Y[]: 
	
	 2  3  0  0  1  0  4  1  0  1 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  0  1 
 > pw :0,42

## ITERATION 162 #######################


> Neighbours evaluated; 19
> Selected Move:	8300	1	-1	3	22000


> New Y[]: 
	
	 2  3  0  1  1  0  4  1  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,415

## ITERATION 163 #######################


> Neighbours evaluated; 22
> Selected Move:	8133	3	6	2	20500


> New Y[]: 
	
	 2  3  4  1  1  0  0  1  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,41

## ITERATION 164 #######################


> Neighbours evaluated; 30
> Selected Move:	8130	2	7	-1	15000


> New Y[]: 
	
	 2  3  4  1  1  0  0  0  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,405

## ITERATION 165 #######################


> Neighbours evaluated; 31
> Selected Move:	8060	3	2	7	17400


> New Y[]: 
	
	 2  3  0  1  1  0  0  4  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,4

## ITERATION 166 #######################


> Neighbours evaluated; 25
> Selected Move:	8200	3	3	6	19400


> New Y[]: 
	
	 2  3  0  0  1  0  1  4  0  1 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  0  1 
 > pw :0,395

## ITERATION 167 #######################


> Neighbours evaluated; 15
> Selected Move:	8280	3	7	8	19400


> New Y[]: 
	
	 2  3  0  0  1  0  1  0  4  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  1 
 > pw :0,39

## ITERATION 168 #######################


> Neighbours evaluated; 11
> Selected Move:	8280	4	8	4	18100


> New Y[]: 
	
	 2  3  0  0  4  0  1  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  1 
 > pw :0,385

## ITERATION 169 #######################


> Neighbours evaluated; 11
> Selected Move:	8280	4	4	6	17500


> New Y[]: 
	
	 2  3  0  0  1  0  4  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  1 
 > pw :0,38

## ITERATION 170 #######################


> Neighbours evaluated; 13
> Selected Move:	8280	3	9	3	18000


> New Y[]: 
	
	 2  3  0  1  1  0  4  0  1  0 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  1  0 
 > pw :0,375

## ITERATION 171 #######################


> Neighbours evaluated; 19
> Selected Move:	8243	4	6	3	20100


> New Y[]: 
	
	 2  3  0  4  1  0  1  0  1  0 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  1  0 
 > pw :0,37

## ITERATION 172 #######################


> Neighbours evaluated; 22
> Selected Move:	8200	3	4	7	19100


> New Y[]: 
	
	 2  3  0  4  0  0  1  1  1  0 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  1  0 
 > pw :0,365

## ITERATION 173 #######################


> Neighbours evaluated; 26
> Selected Move:	8200	4	3	6	17000


> New Y[]: 
	
	 2  3  0  1  0  0  4  1  1  0 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  1  0 
 > pw :0,36

## ITERATION 174 #######################


> Neighbours evaluated; 23
> Selected Move:	8200	4	6	7	18900


> New Y[]: 
	
	 2  3  0  1  0  0  1  4  1  0 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  1  0 
 > pw :0,355

## ITERATION 175 #######################


> Neighbours evaluated; 23
> Selected Move:	8271	1	-1	9	22900


> New Y[]: 
	
	 2  3  0  1  0  0  1  4  1  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,35

## ITERATION 176 #######################


> Neighbours evaluated; 22
> Selected Move:	8580	3	7	5	22800


> New Y[]: 
	
	 2  3  0  1  0  4  1  0  1  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,345

## ITERATION 177 #######################


> Neighbours evaluated; 20
> Selected Move:	8289	3	6	7	21800


> New Y[]: 
	
	 2  3  0  1  0  4  0  1  1  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,34

## ITERATION 178 #######################


> Neighbours evaluated; 18
> Selected Move:	8468	4	5	9	21300


> New Y[]: 
	
	 2  3  0  1  0  1  0  1  1  4 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,345

## ITERATION 179 #######################


> Neighbours evaluated; 20
> Selected Move:	8749	3	5	4	23800


> New Y[]: 
	
	 2  3  0  1  1  0  0  1  1  4 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  1 
 > pw :0,35

## ITERATION 180 #######################


> Neighbours evaluated; 19
> Selected Move:	8435	3	3	5	23300


> New Y[]: 
	
	 2  3  0  0  1  1  0  1  1  4 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  1 
 > pw :0,355

## ITERATION 181 #######################


> Neighbours evaluated; 13
> Selected Move:	8241	4	9	5	23800


> New Y[]: 
	
	 2  3  0  0  1  4  0  1  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  1 
 > pw :0,36

## ITERATION 182 #######################


> Neighbours evaluated; 14
> Selected Move:	7890	4	0	4	19600


> New Y[]: 
	
	 0  3  0  0  2  4  0  1  1  1 


> New S[]: 
	
	 0  1  0  0  1  0  0  0  0  0 
 > pw :0,365

## ITERATION 183 #######################


> Neighbours evaluated; 17
> Selected Move:	7910	3	5	6	18800


> New Y[]: 
	
	 0  3  0  0  2  0  4  1  1  1 


> New S[]: 
	
	 0  1  0  0  1  0  0  0  0  0 
 > pw :0,37

## ITERATION 184 #######################


> Neighbours evaluated; 21
> Selected Move:	7974	1	-1	5	22800


> New Y[]: 
	
	 0  3  0  0  2  1  4  1  1  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  1  0 
 > pw :0,375

## ITERATION 185 #######################


> Neighbours evaluated; 12
> Selected Move:	8223	3	6	2	21300


> New Y[]: 
	
	 0  3  4  0  2  1  0  1  1  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  1  0 
 > pw :0,38

## ITERATION 186 #######################


> Neighbours evaluated; 21
> Selected Move:	7912	4	4	7	22100


> New Y[]: 
	
	 0  3  4  0  1  1  0  2  1  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  1  0 
 > pw :0,385

## ITERATION 187 #######################


> Neighbours evaluated; 22
> Selected Move:	7890	4	2	4	17700


> New Y[]: 
	
	 0  3  0  0  4  1  0  2  1  1 


> New S[]: 
	
	 0  1  0  0  1  0  0  0  0  0 
 > pw :0,39

## ITERATION 188 #######################


> Neighbours evaluated; 18
> Selected Move:	7890	4	4	7	18200


> New Y[]: 
	
	 0  3  0  0  2  1  0  4  1  1 


> New S[]: 
	
	 0  1  0  0  1  0  0  0  0  0 
 > pw :0,395

## ITERATION 189 #######################


> Neighbours evaluated; 15
> Selected Move:	7890	4	4	8	19300


> New Y[]: 
	
	 0  3  0  0  1  1  0  4  2  1 


> New S[]: 
	
	 0  1  0  0  1  0  0  0  0  0 
 > pw :0,4

## ITERATION 190 #######################


> Neighbours evaluated; 15
> Selected Move:	7890	4	7	4	18000


> New Y[]: 
	
	 0  3  0  0  4  1  0  1  2  1 


> New S[]: 
	
	 0  1  0  0  1  0  0  0  0  0 
 > pw :0,395

## ITERATION 191 #######################


> Neighbours evaluated; 17
> Selected Move:	7960	3	7	3	17000


> New Y[]: 
	
	 0  3  0  1  4  1  0  0  2  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  1  0 
 > pw :0,39

## ITERATION 192 #######################


> Neighbours evaluated; 18
> Selected Move:	7960	4	4	5	19700


> New Y[]: 
	
	 0  3  0  1  1  4  0  0  2  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  1  0 
 > pw :0,385

## ITERATION 193 #######################


> Neighbours evaluated; 16
> Selected Move:	7960	4	5	8	19200


> New Y[]: 
	
	 0  3  0  1  1  2  0  0  4  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  1  0 
 > pw :0,38

## ITERATION 194 #######################


> Neighbours evaluated; 15
> Selected Move:	7960	4	5	3	19300


> New Y[]: 
	
	 0  3  0  2  1  1  0  0  4  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  1  0 
 > pw :0,375

## ITERATION 195 #######################


> Neighbours evaluated; 16
> Selected Move:	7960	4	3	4	17200


> New Y[]: 
	
	 0  3  0  1  2  1  0  0  4  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  1  0 
 > pw :0,37

## ITERATION 196 #######################


> Neighbours evaluated; 17
> Selected Move:	7890	3	3	7	18200


> New Y[]: 
	
	 0  3  0  0  2  1  0  1  4  1 


> New S[]: 
	
	 0  1  0  0  1  0  0  0  0  0 
 > pw :0,365

## ITERATION 197 #######################


> Neighbours evaluated; 15
> Selected Move:	7890	4	4	7	19000


> New Y[]: 
	
	 0  3  0  0  1  1  0  2  4  1 


> New S[]: 
	
	 0  1  0  0  1  0  0  0  0  0 
 > pw :0,36

## ITERATION 198 #######################


> Neighbours evaluated; 14
> Selected Move:	7890	4	8	9	19900


> New Y[]: 
	
	 0  3  0  0  1  1  0  2  1  4 


> New S[]: 
	
	 0  1  0  0  1  0  0  0  0  0 
 > pw :0,355

## ITERATION 199 #######################


> Neighbours evaluated; 15
> Selected Move:	7890	4	7	4	19100


> New Y[]: 
	
	 0  3  0  0  2  1  0  1  1  4 


> New S[]: 
	
	 0  1  0  0  1  0  0  0  0  0 
 > pw :0,35

## ITERATION 200 #######################


> Neighbours evaluated; 15
> Selected Move:	7890	4	4	9	19000


> New Y[]: 
	
	 0  3  0  0  4  1  0  1  1  2 


> New S[]: 
	
	 0  1  0  0  1  0  0  0  0  0 
 > pw :0,345

## ITERATION 201 #######################


> Neighbours evaluated; 14
> Selected Move:	7890	4	9	5	18900


> New Y[]: 
	
	 0  3  0  0  4  2  0  1  1  1 


> New S[]: 
	
	 0  1  0  0  1  0  0  0  0  0 
 > pw :0,34

## ITERATION 202 #######################


> Neighbours evaluated; 13
> Selected Move:	7910	3	5	6	19100


> New Y[]: 
	
	 0  3  0  0  4  0  2  1  1  1 


> New S[]: 
	
	 0  1  0  0  1  0  0  0  0  0 
 > pw :0,335

## ITERATION 203 #######################


> Neighbours evaluated; 18
> Selected Move:	7972	1	-1	5	23100


> New Y[]: 
	
	 0  3  0  0  4  1  2  1  1  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  1  0 
 > pw :0,33
________________________________________________________________

Best solution found: 10260
Run Termination time: 31.01.2010 10:37:04
Run duration: 00:00:59.7031250
________________________________________________________________
